Phase Transitions and Algorithmic Thresholds

نویسندگان

  • David W. Etherington
  • Andrew J. Parkes
چکیده

Summary of the results on thresholds in a particular anytime algorithm based on (distributed) iterative repair. Discussion of how such thresholds are algorithm dependent in contrast to algorithmindependent phase transitions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بررسی اثر برخی افزودنی ها بر انتقالات فازی و رفتار حرارتی آمونیوم نیترات

Ammonium nitrate (AN) is widely used in fertilizers, civilian explosives and military explosives. Due to crystalline phase transitions and density changes of AN in the ambient conditions, its usage as oxidizer in solid propellants has some limitations as compared to ammonium perchlorate (AP). Several methods have been introduced to overcome these problems. In the present paper, the phase transi...

متن کامل

Critical Density Thresholds in Distributed Wireless Networks

We present experimental and analytical results showing “zero-one” phase transitions for network connectivity, multi-path reliability, neighbor count, Hamiltonian cycle formation, multiple-clique formation, and probabilistic flooding. These transitions are characterized by critical density thresholds such that a global property exists with negligible probability on one side of the threshold, and...

متن کامل

Magnetic Properties and Phase Transitions in a Spin-1 Random Transverse Ising Model on Simple Cubic Lattice

Within the effective-field theory with correlations (EFT), a transverse random field spin-1 Ising model on the simple cubic (z=6) lattice is studied. The phase diagrams, the behavior of critical points, transverse magnetization,  internal energy, magnetic specific heat are obtained numerically and discussed for different values of p the concentration of the random transverse field.

متن کامل

Phase Transitions and all that

Since the experimental paper of Cheeseman, Kanefsky and Taylor [1] phase transitions in combinatorial problems held the promise to shed light on the “practical” algorithmic complexity of combinatorial problems. However, the connection conjectured in [1] was easily seen to be inaccurate. A much more realistic possible connection has been highlighted by the results (based on experimental evidence...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003